The necklace poset is a symmetric chain order
نویسندگان
چکیده
منابع مشابه
The necklace poset is a symmetric chain order
Let Nn denote the quotient poset of the Boolean lattice, Bn, under the relation equivalence under rotation. Griggs, Killian, and Savage proved that Np is a symmetric chain order for prime p. In this paper, we settle the question of whether this poset is a symmetric chain order for all n by providing an algorithm that produces a symmetric chain decompostion (or SCD). We accomplish this by modify...
متن کاملSymmetric Chain Decomposition of Necklace Posets
A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If P is any symmetric chain order, we prove that P/Zn is also a symmetric chain order, where Zn acts on Pn by cyclic permutation of the factors.
متن کاملOn the Chain Blockers of a Poset
Let P = Ca × Cb be a poset where Ci is the chain 1 < · · · < i. A chain blocker of P is an inlcusionwise minimal subset B ⊆ P with the property that every maximal chain in P contains at least one element of B. In [1] the chain blockers of P are being expressed in term of the Catalan numbers and k fold convolution of the Catalan numbers. In this paper we give a complete description of the chain ...
متن کاملIs Garlic Necklace Effective in the Treatment of Neonatal Jaundice
Background: Hyperbilirubinemia is a prevalent clinical problem which affects 60% of term and 80% of preterm neonates. Garlic is the most well-known remedy used in Iraq for the treatment of jaundice. To test the effectiveness of garlic necklace in the treatment of neonatal jaundice.Methods: This cohort study was conducted in the neonatal intensive care unit (NICU) of Al Zahraa Teaching Hos...
متن کاملThe Spider Poset is
Let Q(k; l) be a poset whose Hasse diagram is a regular spider with k +1 legs having the same length l (cf. Fig. 1). We show that for any n 1 the n th cartesian power of the spider poset Q(k; l) is a Macaulay poset for any k 0 and l 1. In combination with our recent results 2] this provides a complete characterization of all Macaulay posets which are cartesian powers of upper semilattices, whos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2010
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2010.02.003